An Algorithm to Compute a Primary Decomposition of Modules in Polynomial Rings over the Integers
نویسنده
چکیده
We present an algorithm to compute the primary decomposition of a submodule N of the free module Z[x1, . . . , xn]. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the integers. The idea is to compute first the minimal associated primes of N , i.e. the minimal associated primes of the ideal Ann(Z[x1, . . . , xn]/N ) in Z[x1, . . . , xn] and then compute the primary components using pseudo-primary decomposition and extraction, following the ideas of Shimoyama-Yokoyama. The algorithms are implemented in Singular.
منابع مشابه
An Algorithm for Primary Decomposition in Polynomial Rings over the Integers
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and the idea of Shimoyama–Yokoyama resp. Eisenbud– Hunecke–Vasconcelos to extract primary ideals from pseudo–primary ideals. A parallelized version of the algor...
متن کاملClassical quasi-primary submodules
In this paper we introduce the notion of classical quasi-primary submodules that generalizes the concept of classical primary submodules. Then, we investigate decomposition and minimal decomposition into classical quasi-primary submodules. In particular, existence and uniqueness of classical quasi-primary decompositions in finitely generated modules over Noetherian rings are proved. More...
متن کاملFully primary modules and some variations
Let R be a commutative ring and M be an R-module. We say that M is fully primary, if every proper submodule of M is primary. In this paper, we state some characterizations of fully primary modules. We also give some characterizations of rings over which every module is fully primary, and of those rings over which there exists a faithful fully primary module. Furthermore, we will introduce some ...
متن کاملQuasi-Primary Decomposition in Modules Over Proufer Domains
In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...
متن کاملComputing in quotients of rings of integers
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and their behavior under certain quotients. We illustrate the power of our ideas in a new modular normal form algorithm for modules over rings of integers, vastly o...
متن کامل